Characterizations of solution sets of set-valued generalized pseudoinvex optimization problems
نویسندگان
چکیده
منابع مشابه
On Characterization of Solution Sets of Set-Valued Pseudoinvex Optimization Problems
In this paper by using the scalarization method, we consider Stamppachia variational-like inequalities in terms of normal subdifferential for set-valued maps and study their relations with set-valued optimization problems. Furthermore, some characterizations of the solution sets of K-pseudoinvex extremum problems are given.
متن کاملCharacterizations of the Solution Sets of Generalized Convex Minimization Problems
In this paper we obtain some simple characterizations of the solution sets of a pseudoconvex program and a variational inequality. Similar characterizations of the solution set of a quasiconvex quadratic program are derived. Applications of these characterizations are given.
متن کاملGeneralized Strongly Set-valued Nonlinear Complementarity Problems
In this paper, we introduce a new class of generalized strongly set-valued nonlinear complementarity problems and construct new iterative algorithms. We show the existence of solutions for this kind of nonlinear complementarity problems and the convergence of iterative sequences generated by the algorithm. Our results extend some recent results in this field.
متن کاملCharacterizations of solution sets of cone-constrained convex programming problems
In this paper, we consider a type of cone-constrained convex program in finitedimensional space, and are interested in characterization of the solution set of this convex program with the help of the Lagrange multiplier. We establish necessary conditions for a feasible point being an optimal solution. Moreover, some necessary conditions and sufficient conditions are established which simplifies...
متن کاملOptimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities
We derive necessary and sufficient conditions for optimality of a problem with a pseudoconvex objective function, provided that a finite number of solutions are known. In particular, we obtain that the gradient of the objective function at every minimizer is a product of some positive function and the gradient of the objective function at another fixed minimizer. We apply this condition to prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Sciences and Applications
سال: 2016
ISSN: 2008-1901
DOI: 10.22436/jnsa.009.12.38